branching algorithmの例文

• It relies on a Branching Heuristic to pick the next free variable assignment; the branching algorithm effectively makes choosing the variable assignment into a decision tree.
• However, it is possible to implement saturating addition and subtraction in software without branches, using only modular arithmetic and bitwise logical operations that are available on all modern CPUs and their predecessors, including all x86 CPUs ( back to the original Intel 8086 ) and some popular 8-bit CPUs ( some of which, such as the Zilog Z80, are still in production ) . ( However, on simple 8-bit and 16-bit CPUs, a branching algorithm might actually be faster, since there are no pipelines to stall and each instruction always takes multiple clock cycles .)